Uniform lower bound for the least common multiple of a polynomial sequence
نویسندگان
چکیده
منابع مشابه
Note on the Lower Bound of Least Common Multiple
and Applied Analysis 3 It suffices to show that for any s ∈ 1, r − 1 , r−r+sr+r−s (r 2 − 2r + s + 1) (r 2 − (s − 1)) ⩾ (r + 1) 2 , (15) r−rr r−2 (r 2 − r + 1) ⩾ (r + 1) 2 . (16) Equation (15) is equivalent to r−r+sr+r−s ⩾ (r 2 − 2r + s + 1) (r 2 − (s − 1)) (r + 1) 2 . (17) By expanding, it remains to verify for any integer r ⩾ s + 1 ⩾ 2 that s (r) := 0 3 − (4s − 1) r 2 + 2s (s − 1) r + s 2 + u ...
متن کاملThe least common multiple of a quadratic sequence
For any irreducible quadratic polynomial f(x) in Z[x] we obtain the estimate log l.c.m. (f(1), . . . , f(n)) = n log n + Bn + o(n) where B is a constant depending on f .
متن کاملA bivalency proof of the lower bound for uniform consensus
Bivalency argument is a widely-used technique that employs forward induction to show impossibility results and lower bounds related to consensus. However, for a synchronous distributed system of n processes with up to t potential and f actual crash failures, applying bivalency argument to prove the lower bound for reaching uniform consensus is still an open problem. In this paper, we address th...
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملA Uniform Circuit Lower Bound for the Permanent
the new circuit consists of a subexponential number of circuits, each of which is of subex-ponential size, the new circuit is also of subexponential size. The depth of the new circuit family is the same as fC n g but the top layer of MOD p gates has been \absorbed" into the symmetric gate computing B and been replaced by a layer of AND gates of small fan-in. Now, by an appeal to Lemma 9, the ci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2013
ISSN: 1631-073X
DOI: 10.1016/j.crma.2013.10.005